Parallel Solution of Linear Systems by Quadrant Interlocking Factorisation Methods
نویسندگان
چکیده
This paper presents a parallel algorithm for the solution of linear systems and determinant evaluation suitable for use on the proposed parallel computers of the future. The new method can be considered as extending the novel matrix factorisation strategies introduced by Evans and Hatzopoulos [l] and Evans and Hadjidimos [2] in which quadrant interlocking factors are considered instead of the more usual LU factors of triangular decomposition.
منابع مشابه
Czech Technical University in Prague Faculty of Electrical Engineering Reordering and Balanced Mesh Partitioning for the Schur Complement Method
and contributions A finite element method often leads to large sparse symmetric and positive definite systems of linear equations. If memory capacity or computing performance of a single CPU are not sufficient for solving such large linear systems, then parallelisation must be used. The parallel solution by the Schur complement method, on homogeneous parallel machines with distributed memory, i...
متن کاملReordering and Balanced Mesh Partitioning for the Schur Complement Method
and contributions A finite element method often leads to large sparse symmetric and positive definite systems of linear equations. If memory capacity or computing performance of a single CPU are not sufficient for solving such large linear systems, then parallelisation must be used. The parallel solution by the Schur complement method, on homogeneous parallel machines with distributed memory, i...
متن کاملParallel WZ factorization on mesh multiprocessors
We present a parallel algorithm for the QIF (Quadrant Interlocking Factorization) method, which solves linear equation systems using WZ factorization. The parallel algorithm we developed is general in the sense that it does not impose any restrictions on the size of the problem and that it is independent from the dimensions oJ the mesh. The result is an efficient algorithm using half the messag...
متن کاملRecent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presumed difficulty of solving these problems. This paper considers primarily the integer factorisation problem. In recent years the limits of the best integer factorisation algorithms have been extended greatly, due in par...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002